Naive Bayesian Classiier within Ilp-r
نویسندگان
چکیده
When dealing with the classiication problems, current ILP systems often lag behind state-of-the-art attributional learners. Part of the blame can be ascribed to a much larger hypothesis space which, therefore, cannot be as thoroughly explored. However, sometimes it is due to the fact that ILP systems do not take into account the probabilistic aspects of hypotheses when classifying unseen examples. This paper proposes just that. We developed a naive Bayesian classiier within our ILP-R rst order learner. The learner itself uses a clever RELIEF based heuristic which is able to detect strong dependencies within the literal space when such dependencies exist. We conducted a series of experiments on artiicial and real-world data sets. The results show that the combination of ILP-R together with the naive Bayesian classiier sometimes signiicantly improves the classiication of unseen instances as measured by both classiication accuracy and average information score.
منابع مشابه
Naive Bayesian Classiier Committees
The naive Bayesian classiier provides a very simple yet surprisingly accurate technique for machine learning. Some researchers have examined extensions to the naive Bayesian classiier that seek to further improve the accuracy. For example, a naive Bayesian tree approach generates a decision tree with one naive Bayesian classiier at each leaf. Another example is a constructive Bayesian classiier...
متن کاملGeometric Properties of Naive Bayes in Nominal Domains
It is well known that the naive Bayesian classiier is linear in binary domains. However, little work is done on the learnability of the naive Bayesian classiier in nominal domains, a general case of binary domains. This paper explores the geometric properties of the naive Bayesian classiier in nominal domains. First we propose a three-layer measure for the linearity of functions in nominal doma...
متن کاملLazy Bayesian Rules
The naive Bayesian classiier provides a simple and eeective approach to classiier learning, but its attribute independence assumption is often violated in the real world. A number of approaches have sought to alleviate this problem. A Bayesian tree learning algorithm builds a decision tree, and generates a local naive Bayesian classiier at each leaf. The tests leading to a leaf can alleviate at...
متن کاملRestricting the Hypothesis Space, Guiding the Search, and Handling the Redundant Information in Inductive Logic Programming
ii Abstract We developed and implemented an inductive logic programming system and the rst order classiier, called ILP-R. It is capable of eeciently inducing theories in a restricted subset of function free normal programs. It is able to use the hypothesis to classify new instances, by using the naive Bayesian reasoning. The contributions of the system are threefold. First, we devised a weak sy...
متن کاملA Comparison of Induction Algorithms for Selective andnon - Selective Bayesian Classi
In this paper we present a novel induction algorithm for Bayesian networks. This selective Bayesian network classiier selects a subset of attributes that maximizes predictive accuracy prior to the network learning phase, thereby learning Bayesian networks with a bias for small, high-predictive-accuracy networks. We compare the performance of this classiier with selective and non-selective naive...
متن کامل